-angelic Choice for Process Algebra
نویسنده
چکیده
The-angelic choice is an operator that captures the behaviour of the external choice of CSP in a branching time setting. The idea of the-angelic choice is to delay any choice until an observable action happens. In this way, this new operator avoids preemption introduced by internal actions (actions). It is studied in theories with abstraction, more precisely, branching bisimulation and-bisimulation and failure semantics. In addition, an ilustrative example of application is given.
منابع مشابه
-angelic choice: An operator to reduce irrelevant internal activity in process algebra
The-angelic choice is an operator that captures the behaviour of the external choice of CSP in a branching time setting. The idea of the-angelic choice is to delay any choice until an observable action happens. In this way, this new operator avoids preemption introduced by internal actions (actions). It is studied in theories with abstraction, more precisely, branching bisimulation and-bisimula...
متن کاملAlgebra of Monotonic Boolean Transformers
Algebras of imperative programming languages have been successful in reasoning about programs. In general an algebra of programs is an algebraic structure with programs as elements and with program compositions (sequential composition, choice, skip) as algebra operations. Various versions of these algebras were introduced to model partial correctness, total correctness, refinement, demonic choi...
متن کاملAngelic processes
In the formal modelling of systems, demonic and angelic nondeterminism play fundamental roles as abstraction mechanisms. The angelic nature of a choice pertains to the property of avoiding failure whenever possible. As a concept, angelic choice first appeared in automata theory and Turing machines, where it can be implemented via backtracking. It has traditionally been studied in the refinement...
متن کاملProcesses and Formalism for Unbounded Choice
Hesselink, W.H., Processes and formalisms for unbounded choice, Theoretical Computer Science 99 (1992) 105-119. In the field of program refinement a specification construct has been proposed that does not have a standard operational interpretation. Its weakest preconditions are monotone but not necessarily conjunctive. In order to develop a corresponding ca1culus we introduce specification alge...
متن کاملAngelicism in the Theory of Reactive Processes
The concept of angelic nondeterminism has traditionally been employed in the refinement calculus. Despite different notions having been proposed in the context of process algebras, namely Communicating Sequential Processes (CSP), the analogous counterpart to the angelic choice operator of the monotonic predicate transformers, has been elusive. In order to consider this concept in the context of...
متن کامل